Using Optical Flow as an Additional Constraint for Solving the Correspondence Problem in Binocular Stereopsis
نویسندگان
چکیده
A stereo matching algorithm for 3D structure reconstruction relies on the correlation of image features in a pair of images. Usually, two calibrated cameras are used to capture scenes, and the left and right images are rectified to reduce the search space from 2D image region to 1D line. Then, the disparity is defined by the horizontal difference between the corresponding points on the search line. To solve the correspondence problem, various image features such as image intensity, edge, color, infrared light, pixel motion, etc. are employed either separately or integrated together. Among these image features, pixel motion or optical flow has been rarely used as one of the matching features (A. Scheuing & H. Niemann, 1986, G. Sudhir et al, 1995, A. M. Waxman & J. H. Duncan, 1986). In this chapter, we focus on the use of optical flow as an additional constraint in solving the correspondence problem. The stereo matching algorithm for 3D structure reconstruction can be divided into two groups based on the matching primitives: intensity based matching (also referred to as area based matching) and feature based matching. The intensity based matching method searches the best matching points using only intensity values of pixels. The method can further be divided into two groups depending on the smoothness constraints in minimization of matching cost function: local (window-based) method and global method. More details on the intensity based method can be found in a survey by Scharstein (D. Scharstein & R. Szeliski. 2002, M. Z. Brown et al, 2003). The intensity based matching method produces a dense disparity map without any additional post-processing, but usually needs an exhaustive search. Since the intensity based method uses the intensity value at each pixel directly, this method may suffer from the varying illumination problem. The feature based matching method searches the best matching points using some special symbolic feature points, such as line, contour, corner, etc. Since this method calculates disparity values only on the pixels corresponding to the feature point, this method does not require an exhaustive search. Also, symbolic features are less sensitive to illumination changes than pixel intensity, so the calculated disparity is more reliable than that of the intensity based matching method in the case of varying illumination. However, this method O pe n A cc es s D at ab as e w w w .ite ch on lin e. co m
منابع مشابه
Robot Motion Vision Pait I: Theory
A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...
متن کاملBinocular Helmholtz Stereopsis
Helmholtz stereopsis has been introduced recently as a surface reconstruction technique that does not assume a model of surface reflectance. In the reported formulation, correspondence was established using a rank constraint, necessitating at least three viewpoints and three pairs of images. Here, it is revealed that the fundamental Helmholtz stereopsis constraint defines a nonlinear partial di...
متن کاملAmodal completion and the perception of depth without binocular correspondence.
Half-occlusions and illusory contours have recently been used to show that depth can be perceived in the absence of binocular correspondence and that there is more to stereopsis than solving the correspondence problem. In the present study we show a new way for depth to be assigned in the absence of binocular correspondence, namely amodal completion. Although an occluder removed all possibility...
متن کاملBased on Line Matching in Hough Space Using Dynamic Programming
This paper presents a method of using Hough space for solving the correspondence problem in stereo vision. It is shown that the line-matching problem in image space can readily be converted into a point-matching problem in Hough (p-8) space. Dynamic programming can be used for searching the optimal matching, now in Hough space. The combination of multiple constraints, especially the natural emb...
متن کاملContributed Article
Previous Inodels £if stereopsis have concentrated on the task of binocularly matching left and right eye primith'es uniquely. A disparity smoothness constraint is often invoked to limit the number of possible matches. These approaches neglect the fact that surface discontinuities are both abundant in natural eve!)'day scenes, and provide a useful cue for scene segmentation. da Vinci stereopsis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012